Higher-order functions - PDFSEARCH.IO - Document Search Engine

Higher-order functions
Results: 290

#	Item
41	Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values of Add to Reading List Source URL: ndmitchell.com Language: English - Date: 2016-04-19 09:56:22 Software engineering Computer programming Declarative programming Functional programming Data types Programming language comparisons Type theory Higher-order functions Fold Generic programming Map Type class
42	c ACM, 2008. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of the Haskell Sym Add to Reading List Source URL: ndmitchell.com Language: English - Date: 2016-04-19 09:56:22 Software engineering Computer programming Declarative programming Functional programming Higher-order functions Programming language comparisons Concurrent programming languages Functional languages Curry Fold Monad Constraint
43	Submission for IFLFlipping Fold, Reformulating Reduction An Exercise in Categorical Design Gershom Bazerman S&P/CapitalIQ Add to Reading List Source URL: gbaz.github.io Language: English - Date: 2016-02-29 17:49:20 Software engineering Computer programming Category theory Algebra Functional programming Higher-order functions Programming language comparisons Adjoint functors Monad Functor Fold Map
44	Fold-Based Fusion as a Library A Generative Programming Pearl Manohar Jonnalagedda, Sandro Stucki, EPFL Scala ‘15, Portland, June An Example Add to Reading List Source URL: lampwww.epfl.ch Language: English - Date: 2015-06-14 21:36:50 Software engineering Computer programming Computing Higher-order functions Programming language comparisons Functional languages Object-oriented programming languages Procedural programming languages Scala Fold Map ALGOL 68
45	Supero: Making Haskell Faster Add to Reading List Source URL: ndmitchell.com Language: English - Date: 2016-04-19 09:56:22 Software engineering Computer programming Declarative programming Higher-order functions Programming language comparisons Fold Recursion Haskell Tak Map Haskell features
46	Supero: Making Haskell Faster Add to Reading List Source URL: ndmitchell.com Language: English - Date: 2016-04-19 09:56:22 Software engineering Computer programming Declarative programming Higher-order functions Programming language comparisons Functional languages Recursion Literate programming Fold Haskell Map XS
47	Counter-Example Complete Verification for Higher-Order Functions N. Voirol, E. Kneuss, V. Kuncak EPFL Scala Symposium 2015 Add to Reading List Source URL: lampwww.epfl.ch Language: English - Date: 2015-06-14 21:40:26 Software engineering Computer programming Computing Data types Functional languages Functional programming Recursion Sorting algorithms Merge sort Scala List Cons
48	A Supercompiler for Core Haskell Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy ev Add to Reading List Source URL: ndmitchell.com Language: English - Date: 2016-04-19 09:56:22 Software engineering Mathematics Declarative programming Lambda calculus Functional programming Functions and mappings Let expression Embedding Monad Anonymous function
49	Implicit Parallelism through Deep Language Embedding Alexander Alexandrov Asterios Katsifodimos Volker Markl Add to Reading List Source URL: stratosphere.eu Language: English - Date: 2016-05-27 12:05:58 Software engineering Computer programming Computing Higher-order functions Functional languages Concurrent programming languages Programming language comparisons Functional programming Apache Spark List comprehension Oz Monad
50	Supero: Making Haskell Faster Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy evalu Add to Reading List Source URL: ndmitchell.com Language: English - Date: 2016-04-19 09:56:22 Software engineering Computer programming Declarative programming Functional programming Lambda calculus Subroutines Functional languages Literate programming Monad Let expression Glasgow Haskell Compiler Anonymous function

UPDATE